Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network

نویسندگان

  • Nicholas Malcolm
  • Wei Zhao
چکیده

This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satissed. First, message deadlines can only be met if suucient synchronous bandwidth is allocated to each node. Thus, proper synchronous bandwidth allocation is essential if deadlines are to be guaranteed. Second, the target token rotation time (TTRT) determines both the speed of token circulation and the network utilization available to user applications. TTRT should also be chosen carefully to ensure that the token circulates fast enough while maintaining a high available utilization. Finally, suucient buuer space must be provided for outgoing messages, otherwise messages could be lost due to buuer overrow. In this paper, we propose and analyze an integrated method for allocating the synchronous bandwidth and selecting TTRT so that the time constraints of synchronous messages with arbitrary deadlines are guaranteed to be met. Our method diiers from previous work by taking into account both message periods and message deadlines. As a result, the network's capability for guaranteeing real-time messages is increased dramatically. Furthermore, we derive an upper bound for the maximum message waiting time. This gives an upper bound for the required buuer size. We show that this bound is independent of message deadlines | giving considerable exibility to applications in choosing message deadlines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guaranteeing Synchronous Messages With Arbitrary Deadline Constraints In An FDDI Network - Local Computer Networks, 1993., Proceedings., 18th Conference on

This paper addresses issues related t o guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully i f message deadlines are to be satisfied. First, message deadlines can only be met if suficient synchronous bandwidth is allocated to each node. Thus, proper synchronous bandwidth allocation is essential ...

متن کامل

The Worst - Case Scenario for Transmission

We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline , a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI...

متن کامل

An Efficient and Practical Synchronous Bandwidth Allocation Scheme for Deadline Guarantees of Synchronous Messages in an FDDI Network

This report addresses issues related to guaranteeing synchronous message sets with message deadlines equal to periods, in an FDDI network where the timed token protocol is used. FDDI guarantees a bounded access time and an average bandwidth for synchronous traffic, and therefore the timed token protocol is well suited for real-time applications. However, this guarantee alone, though necessary, ...

متن کامل

Asynchronous Mode of FDDI for Real-Time Multimedia Communication - Parallel and Distributed Real-Time Systems, 1996., Proceedings of the 4th International Workshop o

FDDI network is a network that can provide real-time message delivery, It supports two classes of messages: synchronous class and asynchronous class. Guaranteeing deadlines of real-time messages with FDDI synchronous mode has been studied extensively. However, most existing FDDI products support asynchronous message transmission only. In this paper, we develop an analytic method for guaranteein...

متن کامل

Performance Evaluation of a Bandwidth Allocation Scheme for Guaranteeing Synchronous Messages with Arbitrary Deadlines in an FDDI Network

In this paper, we study the performance of FDDI networks in t e rms of their guarantee probability, i . e . , the probability that a set of synchronous messages are guaranteed t o meet their deadlines. Traditional techniques such as queuing analysis cannot be directly used t o derive the guarantee probability. To coun.ter this problem, we develop a new geometric model of schedulability. Based o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993